An Example for Concurrent Re ective Computations in Rewriting Logic

نویسندگان

  • Hiroshi Ishikawa
  • Kokichi Futatsugi
  • Takuo Watanabe
چکیده

Rewriting logic can represent dynamic behaviors of concurrent and/or reactive systems declaratively. Declarative descriptions in rewriting logic are expected to be amenable to analysis of interesting properties. The group-wide architecture based on the actor model is a speci c concurrent re ective computation model based on "group-wide re ection". It has a potential of modeling cooperative behaviors of several software modules (or agents). This paper provides some basic considerations on methods of modeling the group-wide architecture in rewriting logic and a brief proof that the metalevel group of terms correctly represents the operational semantics of the group in terms of transitions of con gurations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Concurrent Re Blockinective Computations in Rewriting Logic

Rewriting logic can represent dynamic behaviors of concurrent and/or reactive systems declaratively. Declarative descriptions in rewriting logic are expected to be amenable to analysis of interesting properties. The group-wide architecture based on the actor model is a speci c concurrent re ective computation model based on \group-wide re ection". It has a potential of modeling cooperative beha...

متن کامل

Axiomatizing Re ective Logics and Languages

The very success and breadth of re ective techniques underscores the need for a general theory of re ection. At present what we have is a wide-ranging variety of re ective systems, each explained in its own idiosyncratic terms. Metalogical foundations can allow us to capture the essential aspects of re ective systems in a formalismindependent way. This paper proposes metalogical axioms for re e...

متن کامل

Using Rewriting Logic to implement FULL

A common problem of automated tools for Formal Methods is their difficulty in dealing with infinite systems. Such systems may arise through the use of infinite data types. For example, in the LOTOS [6] formal description technique the simple process g?x : Nat; exit results in an infinite choice, one for each member of Nat. Rewriting logic [7] is a possible approach to dealing with such systems....

متن کامل

Semantics of Concurrent Logic Programming as Uniform Proofs

We describe LC , a formalism based on the proof theory of linear logic, whose aim is to specify concurrent computations and whose language restriction (as compared to other linear logic language) provides a simpler operational model that can lead to a more practical language core. The LC fragment is proveded to be an abstract logic programming language, that is any sequent can be derived by uni...

متن کامل

Concurrent Logic Programming as Uniform Linear Proofs

We describe a formalism based on the proof theory of linear logic, whose aim is to specify concurrent computations and whose language restriction (as compared to other linear logic languages) provides a simpler operational model that can lead to a more practical language core. The fragment is proved to be an abstract logic programming language, that is any sequent can be derived by uniform proo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996